Optimized function assignment in a multi-core processor

ABSTRACT

A system including an optimization module executing on and configured to enable a computer processor to: receive a user application including a set of functions and simulate execution of different configurations of the functions on a multi-core microprocessor chip, where: the multi-core microprocessor chip includes a set of tiles arranged in a grid configuration, where each tile includes a processor core and a corresponding router, where each router is communicatively coupled with at least one other router to form a network-on-chip and implements a deterministic static priority routing policy, and the different configurations include execution of the functions by different groups of tiles. The computer processor is further enabled to monitor network traffic patterns of the execution of the different configurations; rank the different configurations based on the corresponding network traffic patterns; and select an optimal configuration of the different configurations based on the ranking.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is related to, and herein incorporates by reference forall purposes, U.S. patent application Ser. No. 15/298,180 filed Oct. 19,2016, now U.S. Pat. No. 10,355,975 issued Jul. 16, 2019, naming PaulMichael Sebexen, entitled “LATENCY GUARANTEED NETWORK ON CHIP”, and U.S.patent application Ser. No. 15/298,187 filed Oct. 19, 2016, now U.S.Pat. No. 10,127,043 issued Nov. 13, 2018, naming Paul Michael Sebexen,entitled “IMPLEMENTING CONFLICT-FREE INSTRUCTIONS FOR CONCURRENTOPERATION ON A PROCESSOR”.

BACKGROUND

A central processing unit (CPU) is an electronic circuit that carriesout the instructions of a computer program by performing the basicarithmetic, logical, control and input/output (I/O) operations specifiedby the instructions. The use of CPUs in electronic and other productshas continued to increase, while at the same time CPUs have becomesmaller, faster, and less power consuming.

A multi-core processor may include two or more independent processingunits, called “cores”. Each core may perform similar operations as aconventional single core CPU. However, because the multiple cores canrun multiple instructions at the same time, the overall speed forprograms responsive to parallel computing may be increased. The multiplecores are typically integrated onto a single integrated circuit die(also known as a chip), or onto multiple dies in a single chip package.

Many different architectures are possible for single core CPUs andmulti-core processors, providing different advantages in differentaspects. However, there continues to be a need for faster, smaller, lesspower consuming, more reliable, and easier to use architectures.

SUMMARY

In general, in one aspect, embodiments relate to a system including acomputer processor; an optimization module executing on the computerprocessor and configured to enable the computer processor to: receive auser application, where the user application includes a set offunctions; simulate execution of different configurations of the set offunctions on a multi-core microprocessor chip, where: the multi-coremicroprocessor chip includes a set of tiles arranged in a gridconfiguration, where each tile includes a processor core and acorresponding router, where each router is communicatively coupled withat least one other router to form a network-on-chip and each routerimplements a deterministic static priority routing policy, and thedifferent configurations include execution of the set of functions bydifferent groups of tiles; monitor network traffic patterns of theexecution of the different configurations; rank the differentconfigurations according to ranking criteria, where the ranking criteriais used to rank each of the different configurations based on thecorresponding network traffic patterns; and select an optimalconfiguration of the different configurations based on the ranking.

In general, in one aspect, embodiments relate to a method includingreceiving a user application, where the user application includes a setof functions; simulating execution of different configurations of theset of functions on a multi-core microprocessor chip, where: themulti-core microprocessor chip includes a set of tiles arranged in agrid configuration, where each tile includes a processor core and acorresponding router, where each router is communicatively coupled withat least one other router to form a network-on-chip and each routerimplements a deterministic static priority routing policy, and thedifferent configurations include execution of the set of functions bydifferent groups of tiles; monitoring network traffic patterns of theexecution of the different configurations; ranking the differentconfigurations according to ranking criteria, where the ranking criteriais used to rank each of the different configurations based on thecorresponding network traffic patterns; and selecting an optimalconfiguration of the different configurations based on the ranking.

In general, in one aspect, embodiments relate to a method includingreceiving a user application, where the user application includes a setof functions to be executed by a multi-core microprocessor chip, wherethe multi-core microprocessor chip includes a set of tiles eachincluding a processor core and a corresponding router, where each routeris communicatively coupled with at least one other router to form anetwork-on-chip grid and each router implements a deterministic staticpriority routing policy; receiving an identification of a high priorityfunction of the set of functions; identifying one or more tiles withhigh routing priority according to the static priority routing policy;and assigning execution of the high priority function to the one or moretiles with high routing priority.

Other embodiments will be apparent from the following description andthe appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example, and not by way oflimitation, in the figures of the accompanying drawings and in whichlike reference numerals refer to similar elements.

FIG. 1 shows a block diagram of a prior art computer architecture.

FIG. 2 shows an example multi-core processor network-on-chiparchitecture, in accordance with one or more embodiments.

FIG. 3 shows an example processor core for use in a cache-less computerarchitecture, in accordance with one or more embodiments.

FIG. 4 shows an example multi-core processor network-on-chiparchitecture, in accordance with one or more embodiments.

FIG. 5 shows a flowchart in accordance with one or more embodiments.

FIG. 6 shows example tiles of a multi-core processor network-on-chiparchitecture, in accordance with one or more embodiments.

FIGS. 7A and 7B show flowcharts in accordance with one or moreembodiments.

FIGS. 8A-8E show example instruction words, in accordance with one ormore embodiments.

FIG. 9 shows a flowchart in accordance with one or more embodiments.

FIG. 10 shows a computer system in accordance with one or moreembodiments.

DETAILED DESCRIPTION

A portion of the disclosure of this patent document may contain materialthat is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by anyone of the patent documentor the patent disclosure, as it may appear in the Patent and TrademarkOffice patent file or records, but otherwise reserves all copyrightswhatsoever.

Specific embodiments will now be described in detail with reference tothe accompanying figures. Like elements in the various figures aredenoted by like reference numerals for consistency. In the followingdetailed description of embodiments, numerous specific details are setforth in order to provide a more thorough understanding of theinvention. While described in conjunction with these embodiments, itwill be understood that they are not intended to limit the disclosure tothese embodiments. On the contrary, the disclosure is intended to coveralternatives, modifications and equivalents, which may be includedwithin the spirit and scope of the disclosure as defined by the appendedclaims. However, it will be apparent to one of ordinary skill in the artthat the invention can be practiced without these specific details. Inother instances, well-known features have not been described in detailto avoid unnecessarily complicating the description.

FIG. 1 shows a block diagram of a prior art computer architecture 199.The architecture 199 may include one or more processor cores (e.g.,cores 100A-100D). Each core may include at least one L-level cache(e.g., L1 caches 101A-101D, respectively). The architecture 199 mayinclude one or more cache levels outside the cores (e.g., L2 caches102A-102D, L3 cache 103A, and/or other cache levels not shown). Thecores 100A-100D and/or the caches may be coupled with other systemmemory 104 (e.g., dynamic random-access memory (DRAM)).

Each core may include various components. For example, as shown withrespect to core 100D, each core may include an arithmetic logic unit(ALU) 110, a floating point unit (FPU) 116, a register file (RF) 114, atranslation lookaside buffer (TLB) 111, and/or the L1 cache 101D. In oneor more embodiments, some of the components may be located outside ofthe core (e.g., the TLB 111).

Many microprocessor chips include caches organized in a hierarchy ofcache levels (e.g., L1 caches 101A-101D, L2 caches 102A-102D, L3 cache103A, etc.). The caches are smaller, faster, and more proximate memoriesto the cores 100A-100D as compared to the main memory 104. The cachesstore copies of data from frequently used main memory 104 locations. Thecaches may also store some of or the same data as other caches (e.g., L2caches 102A and 102B may store the same data). As a result, futurerequests for that data can be served faster. The data stored in a cachemight be the result of an earlier computation, or the duplicate of datastored elsewhere.

The caches may be used by the one or more cores 100A-100D to reduce theaverage time to access data from the main memory 104. For example, whena core needs to read from or write to a location in the main memory 104,the core first checks whether a copy of that data is in the L1 cache. Ifso (often referred to as a “cache hit”), the core immediately reads fromor writes to the L1 cache, which is much faster than reading from orwriting to main memory 104. If not (often referred to as a “cachemiss”), the core next checks whether a copy of that data is in the L2cache, and so on. However, cache architectures may include drawbacks.For example storing the same data in multiple locations requiresadditional components (e.g., circuitry) in a layout and increases powerconsumption, thereby achieving a less efficient architecture.

Further, problems may arise with inconsistent data when multiple coresin a microprocessor chip maintain caches of a common memory resource.When one copy of an operand is changed, the other copies of the operandmust also be changed. A cache coherency policy can be implemented toensure that changes in the values of shared operands are propagatedthroughout the system in a timely fashion. As a result, cache coherencemaintains the consistency of shared resource data that is stored inmultiple local caches. For example, if the core 100A has a copy of data(e.g., from L2 cache 102A) from a previous read, and the core 100Bchanges the corresponding data (e.g., in L2 cache 102B), the core 100Acould be left with an invalid cache of data without any notification ofthe change. Cache coherence is intended to manage such conflicts andmaintain consistency between the caches and/or the main memory 104.Referring back to the example immediately above, a cache coherencypolicy could cause the memory block in the L2 cache 102A to be updatedaccording to the change to the corresponding memory block in the L2cache 102B to avoid conflicts. However, a cache coherency policyrequires additional components in a layout, increases the amount of readand write operations, increases minimum latency, and increases powerconsumption.

Another drawback of cache architecture is the consequences of the use ofvirtual memory addressing. Virtual memory is a memory managementtechnique that maps memory addresses used by a program, called virtualaddresses, into physical addresses in memory. The operating systemmanages virtual address spaces and the assignment of real memory tovirtual memory. Address translation hardware in a microprocessor, oftenreferred to as a memory management units (MMU) and/or translationlookaside buffers (TLB), translates virtual addresses to physicaladdresses. But the use of MMUs/TLBs requires additional components in alayout (usually multiple components along a datapath), increaseslatency, and increases power consumption.

FIG. 2 shows an example multi-core processor network-on-chiparchitecture 299, in accordance with one or more embodiments. In one ormore embodiments, the architecture 299 includes one or more cores200A-233A and one or more routers 200B-233B. The architecture 299 mayalso include or be communicatively coupled with a main system memory204.

In one or more embodiments, a core includes functionality to carry outthe instructions of a computer program by performing the basicarithmetic, logical, control, and input/output operations specified bythe instructions. For example, a core may be a microprocessor thataccepts data as input, processes the data according to instructions, andprovides results as output. The cores 200A-233A may be the same as orsimilar to the core 300A of FIG. 3, discussed below. In one or moreembodiments, a router includes functionality to receive one or morepackets (e.g., including a data payload and destination addressinformation) and route the one or more packets for delivery to thedestination.

In one or more embodiments, each core may be communicatively coupled andassociated with a respective router (e.g., through one or more datalines), forming a tile. For example, the core 200A is coupled with therouter 200B (forming a tile 200), the core 201A is coupled with therouter 201B (forming a tile 201, not indicated in FIG. 2), the core 210Ais coupled with the router 210B (forming a tile 210, not indicated inFIG. 2), and so on (forming tiles 200-233, partially not indicated inFIG. 2).

Further, each router may be communicatively coupled with one or morerouters. For example, the router 200B is coupled with at least therouters 201B and 210B. In another example, the router 211B is coupledwith the routers 201B, 210B, 212B, and 221B. The routers 200B and 211Bmay be ultimately coupled with every other router through intermediaterouters. As a result, each of the cores 200A-233A may be communicativelycoupled with the other cores 200A-233A through the routers 200B-233B,thereby forming a “network” of tiles (core and router pairs). Forexample, the core 200A is coupled with the core 233B through the networkof routers 200B-233B. In one or more embodiments, each router may becoupled with routers that are diagramically (e.g., architecturallyand/or in hardware) either above, below, to the left of, and/or to theright of the router. Accordingly, the routers may be arranged in an X-Ygrid.

In one or more embodiments, the architecture 299 does not include ahierarchy of cache levels (e.g., L1 cache, L2 cache, L3 cache, and soon), any cache coherency logic/components, and/or associated TLBs(translation lookaside buffer to assist in cache memory addressresolving) inside or outside any core. Instead, each core may include ascratchpad memory (discussed in further detail below). It should beappreciated that in some embodiments, each core may not include ascratchpad memory but instead may be communicatively coupled with ascratchpad memory.

It should be appreciated that while FIG. 2 shows a 4 by 4 grid of 16cores, embodiments support other arrangements and numbers of cores(e.g., an 8 by 8 grid of 64 cores, an 8 by 4 grid of 32 cores, etc.).For example, the dotted arrows in FIG. 2 illustrate that the outermostrouters could be optionally coupled with additional tiles. In otherwords, the illustrated tiles 200-233 could be a subset of a larger tilenetwork not shown. In other embodiments, the illustrated tiles 200-233constitute all tiles of a microprocessor chip. In some embodiments, oneor more of the outermost routers may be coupled with other electroniccircuitry of a microprocessor chip.

FIG. 3 shows an example processor core 300A for use in a cache-lesscomputer architecture, in accordance with one or more embodiments. Thecore 300A may include a scratchpad memory (“scratchpad”) 304, a prioritydecoder 306, an arithmetic logic unit (ALU) 310, a general purposeregister file (GRF) 312, a floating point register file (FRF) 314, afloating point unit (FPU) 316, a fetch unit 320, a load store (“LS0”)unit 322, a load store (“LS1”) unit 324, and/or an inbox unit 326.

In one or more embodiments, a router 300B may be communicatively coupledand associated with the core 300A. The core 300A and the router 300B maytogether form a tile 300 (not indicated in FIG. 3) in a multi-coreprocessor network-on-chip architecture. For example, the core 300A andthe router 300B could be the core 200A and the router 200B of FIG. 2,respectively. In another example, the tile 300 may represent each tile200-233 discussed with respect to FIG. 2. Accordingly, the router 300Bmay be communicatively coupled with routers of other tiles (not shown inFIG. 3).

The ALU 310 may include functionality to perform various operations(e.g., arithmetic and bitwise logical operations on integer binarynumbers). The FPU 316 may include functionality to perform variousoperations on integer and/or floating point numbers (e.g., addition,subtraction, multiplication, division, square root, and bitshifting).The ALU 310 and/or the FPU 316 may include vector operationfunctionality. For example, the ALU 310 may include functionality toadd, in parallel, individual values of a first vector with individualvalues of a second vector and store the resulting values as an outputvector.

The GRF 312 may be communicatively coupled with the ALU 310 and includefunctionality to store data that is to be operated on or has alreadybeen operated on by the ALU 310. The FRF 314 may be communicativelycoupled with the FPU 316, and may include functionality to store datathat is to be operated on or has already been operated on by the FPU316.

It should be appreciated that one or more embodiments may supportvarious architectures. For example, the existence of more than one ALU310, GRF 312, FRF 314, and/or FPU 316. In another example, no ALUs, noFPUs, and/or only one load store. It should also be appreciated thatembodiments support other configurations. For example, the FPU 316 mayalso be communicatively coupled with the GRF 312 and operate on datastored in the GRF 312, and/or the ALU 310 may also be communicativelycoupled with the FRF 314 and operate on data stored in the FRF 314. Inone or more embodiments, the ALU 310 executes control flow operations.

The fetch unit 320 may be communicatively coupled with the scratchpad304, and may include functionality to read/receive instructions from thescratchpad 304. The instructions may, for example, be used to instructfunctional units of the core 300A (e.g., the ALU 310, the FPU 316, etc.)to perform specified operations on specified data.

In one or more embodiments, the LS0 322 may be communicatively coupledwith the scratchpad 304, and may include functionality toreceive/provide data from/to the scratchpad 304. The LS0 322 may becommunicatively coupled with the GRF 312 and the FRF 314, and mayinclude functionality to receive/provide data from/to the GRF 312 andthe FRF 314. For example, the LS0 322 may load/read data from thescratchpad 304 to provide to the GRF 312 and/or the FRF 314, ultimatelyfor operation by the ALU 310 and/or the FPU 316. In another example, theLS0 322 may receive/read data from the GRF 312 and/or the FRF 314 tostore/write in the scratchpad 304.

In one or more embodiments, the LS1 324 may include at least the samefunctionality as the LS0 322. However, the LS1 324 (aka “outbox” 324)may be additionally communicatively coupled with the router 300B and mayadditionally include functionality to provide data to the router 300B(which may ultimately provide the data to components outside of the tile300).

In one or more embodiments, the inbox 326 may be communicatively coupledwith the router 300B and may include functionality to receive data fromthe router 300B (which may be provided from components outside of thetile 300). The inbox 326 may be also communicatively coupled with thescratchpad 304. The inbox 326 may include functionality to store datareceived from the router 300B and ultimately provide the data to thescratchpad 304 for storage. The inbox 326 may be or may functionsimilarly to a single-stage memory element (discussed below).

In one or more embodiments, the scratchpad 304 is a data storage unit.For example, the scratchpad 304 may be high-speed local memory used fortemporary storage of data during application execution. Advantagesoffered by scratchpad memory may include decreased energy usage, on-chiparea savings, and/or possibly guaranteed latency. In one example, thescratchpad 304 may be formed by static random-access memory (SRAM). Inone or more embodiments, the scratchpad 304 includes multiple memorymodules or banks, each with a single communication port. For example, asshown in FIG. 3, the scratchpad 304 includes 8 banks, each with a singlecommunication port. In one example, each bank includes 16 kilobytes (KB)of storage capacity, thereby constituting 128 KB of storage capacity forthe scratchpad 304.

In one or more embodiments, the functional units of the core 300A havedirect or indirect read and/or write access from/to the scratchpad 304.For example, the fetch unit 320, LS0 322, LS1 324, and/or inbox 326 mayhave substantially direct access with the scratchpad 304 (e.g., besidesthe intervening priority decoder 306 in some embodiments). Further, theALU 310, GRF 312, FRF 314, and/or FPU 316 may have substantiallyindirect access with the scratchpad 304 (through intervening units likethe LS0 322 and/or LS1 324). Further, in one or more embodiments, thefunctional units of the core 300A have read and/or write access from/toall banks of the scratchpad 304. For example, the LS0 322 has access tobanks 0-7 of the scratchpad 304, the LS1 324 has access to banks 0-7 ofthe scratchpad 304, and so on.

In one or more embodiments, multiple functional units of the core 300Ahave concurrent read and/or write access from/to all or some banks ofthe scratchpad 304. For example, the LS1 324 can access banks 0 and 1,the inbox 326 can access banks 2 and 3, the fetch unit 320 can accessbanks 4 and 5, and the LS0 322 can access banks 6 and 7, all occurringconcurrently. As a result, the architecture minimizes or eliminatesmemory access bottlenecks.

It should be appreciated that one or more embodiments supportalternative architectures of the scratchpad 304. For example, thescratchpad 304 may include multiple banks, each bank having multiplecommunication ports. In another example, the scratchpad 304 may includea single memory module with a single communication port (e.g., as shownin FIG. 4). In such an architecture, the memory module may bepartitioned to provide multiple logical banks (e.g., 2 logical banks, 4logical banks, 8 logical banks, and so on). In yet another example, thescratchpad 304 may include a single memory module with multiplecommunication ports (e.g., 8 ports). Regardless of the particular memoryarchitecture, the functional units may still have read and/or writeaccess from/to the entire scratchpad.

In one or more embodiments, whether the scratchpad 304 includes multiplememory banks, a single memory module logically partitioned into banks,or a single memory module, the scratchpad 304 is physically addressable(e.g., by units/components inside and/or outside the core 300A). As aresult, virtual addressing is avoided and the use of TLBs can beminimized or entirely eliminated.

In one or more embodiments, if the scratchpad 304 includes multiplememory banks, each bank's physical addressing is sequential withadjacent or contiguous banks. For example, bank 1's physical addressingcontinues where bank 0's physical addressing ends, bank 2's physicaladdressing continues where bank 1's physical addressing ends, and so on.As a result, memory accesses involving data stored across more than onebank can be more simply addressed. It should be appreciated that in someembodiments, each bank's physical addressing may be sequential withadjacent or contiguous banks while not continuous. For example, theremay be a gap between bank 1's and bank 0's physical addressing. In oneor more embodiments, the physical addressing monotonically increases ineach physical dimension (a sufficiently higher address means a higherbank number, X-axis coordinate in a grid of cores, Y-axis coordinate ina grid of cores, chip ID of network-on-chip chips, and so on).

In one or more embodiments, the priority decoder 306 may becommunicatively coupled with the scratchpad 304, fetch unit 320, LS0322, LS1 324, and/or inbox 326. The priority decoder 306 may includefunctionality to facilitate communication between the scratchpad 304 andother functional units of the core 300A. In some embodiments, thefunctional units are coupled with the priority decoder 306, which is inturn coupled with the scratchpad 304 (e.g., each bank of the scratchpad304). Each functional unit may be coupled with the priority decoder 306(and/or ultimately with the scratchpad 304) through multiple linescorresponding with banks of the scratchpad 304. For example, FIG. 3shows that functional units can communicate via an 8-byte (64-bit or64-line) bus. Other functional units can communicate via a 16-byte(128-bit or 128-line) bus. A 8-byte or 16-byte bus may include addressbits, or address lines may be in addition to the 8-byte or 16-byte bus.It should be appreciated that buses are not limited to 8-byte or 16-bytebuses, other buses may be implemented.

In some embodiments, the priority decoder 306 may be implemented withvarious multiplexers or similar components. For example, the fetch unit320, LS0 322, LS1 324, and inbox 326 may each include a separate linecoupled with a first multiplexer, where the first multiplexer is coupledwith the bank 1 and selects which functional unit to couple with thebank 1. Accordingly, the functional units may each include separatelines to multiplexers, where each multiplexer is coupled with a bank andselects which functional unit to couple with that bank.

Returning to FIG. 2, in one or more embodiments, each of the cores200A-233A includes a scratchpad memory (e.g., the same as or similar tothe scratchpad 304). As a result, conventional L-level caches may not beused in the architecture 299 because the scratchpad memories of thecores 200A-233A provide data storage for each of the cores 200A-233A.For example, a scratchpad within the core 200A may provide data storagefor the core 200A, a scratchpad within the core 201A may provide datastorage for the core 201A, and so on. Further, the scratchpad memoriesof the cores 200A-233A provide data storage for other cores of the cores200A-233A and/or the associated processor chip(s). For example, dataresulting from an operation of the core 200A may be stored in thescratchpad memory of the core 211A. In another example, data needed fora future operation by the core 200A may be read from the scratchpadmemory of the core 211A. In yet another example, data resulting from anoperation or necessary for a future operation may be stored across thescratchpads of multiple cores. In a further example, data resulting froman operation or necessary for a future operation may be stored in thescratchpad of a core located in a different chip than that of the coreexecuting the operation, where the cores of the different chips are partof the same core network.

In one or more embodiments, the physical addressing of each core'sscratchpad is continuous with adjacent or contiguous cores' scratchpadaddressing. For example, the core 201A scratchpad physical addressingcontinues where the core 200A scratchpad physical addressing ends, thecore 202A scratchpad physical addressing continues where the core 201Ascratchpad physical addressing ends, and so on. Or, for example, thecore 210A scratchpad physical addressing continues where the core 200Ascratchpad physical addressing ends, the core 220A scratchpad physicaladdressing continues where the core 210A scratchpad physical addressingends, and so on. As a result, memory accesses involving data stored atother cores can be more simply addressed, without the use of TLBs.

Further, the functional units of the cores 200A-233A may have readand/or write access from/to the scratchpads of other cores. For example,the ALU, FPU, LS0, LS1, and/or inbox of the core 200A may have accesswith the scratchpad of the core 211A (e.g., through interveningcomponents like the routers) if an instruction involves a physicaladdress corresponding to the scratchpad of the core 211A.

FIG. 4 shows an example multi-core processor network-on-chiparchitecture 499, in accordance with one or more embodiments. In one ormore embodiments, the architecture 499 includes one or more cores400A-411A and one or more routers 400B-411B.

In one or more embodiments, each core may be communicatively coupled andassociated with a respective router (e.g., through one or more datalines), forming a tile. For example, the core 400A is coupled with therouter 400B (forming a tile 400), the core 401A is coupled with therouter 401B (forming a tile 401, not indicated in FIG. 4), the core 410Ais coupled with the router 410B (forming tile 410, not indicated in FIG.4), and so on (forming tiles 400-411, partially not indicated in FIG.4).

Further, each router may be communicatively coupled with one or morerouters (e.g., through an input and output port). For example, therouter 400B is coupled with at least the routers 401B and 410B. Inanother example, the router 411B is coupled with the routers 401B and410B. The routers 400B and 411B may be ultimately coupled with everyother router through intermediate routers. As a result, each of thecores 400A-411A may be communicatively coupled with the other cores400B-411B through the routers, thereby forming a “network” of tiles(core and router pairs). For example, the core 400A is coupled with thecore 411B through the network of routers 400B-411B. In one or moreembodiments, each router may be coupled with routers that arediagramically (e.g., architecturally and/or in hardware) either above,below, to the left of, and/or to the right of the router. Accordingly,the routers may be arranged in an X-Y grid.

It should be appreciated that while FIG. 4 shows a 2 by 2 grid of 4cores, embodiments support other arrangements and numbers of cores(e.g., an 8 by 8 grid of 64 cores). For example, the outermost arrows inFIG. 4 illustrate that the outermost routers could be optionally coupledwith additional tiles not shown. In other words, the illustrated tiles400-411 could be a subset of a larger tile network not shown. Forexample, the tile 400 could be the same as or similar to the tile 200 ofFIG. 2, the tile 401 could be the same as or similar to the tile 201 ofFIG. 2, the tile 410 could be the same as or similar to the tile 210 ofFIG. 2, and the tile 411 could be the same as or similar to the tile 211of FIG. 2. In another example, the tile 400 could be the same as orsimilar to the tile 211 of FIG. 2, the tile 401 could be the same as orsimilar to the tile 212 of FIG. 2, the tile 410 could be the same as orsimilar to the tile 221 of FIG. 2, and the tile 411 could be the same asor similar to the tile 222 of FIG. 2.

In other embodiments, the illustrated tiles 400-411 constitute all tilesof a microprocessor chip. In some embodiments, one or more of theoutermost routers in the grid may be communicatively coupled with otherelectronic circuitry of a microprocessor chip. Further, one or moreoutermost routers may not be communicatively coupled with otherelectronic components on their outermost side(s). For example, if therouter 400B is at the west-most edge of the grid, the output port 400Wand corresponding west input port may not be communicatively coupledwith other components, or may not exist at all.

In one or more embodiments, single-stage memory elements may store datatraveling between routers and/or cores. The memory elements may act as asingle-stage buffer, holding only one stage of data (e.g., a datapacket) at a time. For example, a single-stage memory element may be a Dflip-flop or register. It should be noted that while the term “buffer”may be used in the present disclosure, such buffers are understood to besingle-stage memory elements. In some embodiments, FIFO (“first in,first out”) memory elements with two or more stages may be used.

In one or more embodiments, a single-stage memory element may be locatedbetween one or more routers (and/or between a router and itscorresponding core). In some embodiments, the single-stage memoryelement is located on an input and/or output port of the router logic.In one or more embodiments, the router logic includes the input and/oroutput single-stage memory element.

For example, buffers 400N (“north”), 400W (“west”), 400S (“south”), and400E (“east”) may be located between the router 400B and othercomponents (e.g., routers and/or cores) receiving data from the router400B (e.g., output data lines with respect to the router 400B). Forexample, a buffer 400S may be located on a router 400B output data linebetween the router 400B and the router 401B, and a buffer 400E may belocated on a router 400B output data line between the router 400B andthe router 410B. The buffers 400N and 400W may be located diagramicallynorth and west of the router 400B in cases where routers exist north andwest of the router 400B (or for communication with other components of achip). The terms “north”, “west”, “south”, and “east” are used here todescribe the diagramic location of buffers with relation to a router(e.g., buffers that are above, to the left of, below, and to the rightof a router, respectively). Accordingly, the buffers may be arrangeddiagramically (e.g., architecturally and/or in hardware) above, to theleft of, below, and to the right of a router.

Further or in another example, buffers 401N and 410W may be locatedbetween the router 400B and other components (e.g., routers and/orcores) transmitting data to the router 400B (e.g., input data lines withrespect to the buffer 400B).

In one or more embodiments, routers are located within theircorresponding core. For example, while the router 400B is shown to beoutside of the core 400A, the components making up the router 400B maybe inside, around, or partially overlapping an area of components makingup the core 400A in hardware.

In one or more embodiments, buffers may be located inside of a router.For example, while the buffers 400N, 400W, 400S, and 400E are shown tobe outside of the router 400B, those buffers may be located inside therouter 400B in hardware. In other embodiments, buffers may be locatedoutside of a router. For example, buffers 400N, 400W, 400S, and 400E maybe located outside the router 400B and instead on a data linecommunicatively coupling routers.

In one or more embodiments, a core includes input and output portbuffers. For example, referring to FIG. 3, the inbox 326 may be or mayfunction similarly to an input buffer between the core 300A and therouter 300B. In another example, the LS1 324 (aka outbox 324) may be ormay function similarly to an output buffer between the core 300A and therouter 300B.

In one or more embodiments, the buffers transfer received data after oneclock cycle. For example, one or more buffers may be implemented using aD flip-flop or similar component. Each buffer may store data received atan input terminal of the buffer at a definite portion of the clock cycle(such as the rising or falling edge of the clock). The buffer may thenprovide the stored data at an output terminal of the buffer at the nextdefinite portion of the clock cycle (such as the rising or falling edgeof the clock). As a result, the buffers may behave as one-cycle buffersthat do not store data for more than one cycle but instead pass the dataduring the next cycle after having received the data.

In one or more embodiments, the buffers do not pass the data on the verynext cycle in cases where there is a traffic condition (discussedbelow). However, in such cases, the buffers may not receive and/or storeadditional packets, but instead may simply retain the current packetuntil the traffic condition is resolved (discussed below). As a result,the buffers may behave as one-stage buffers that do not store more thanone stage of data. In some embodiments, the buffers may be FIFO (“firstin, first out”) memory elements with two or more stages.

In one or more embodiments, a core provides data to be transmitted to alocation outside of the core (e.g., another core or other component ofthe same chip, a core or other component of another chip, or a memorylocation outside the core). For example, an instruction (e.g., fromanother core) may instruct the core 400A to store data to a memorylocation outside of the core 400A. As a result, the core 400A mayprovide a data packet (e.g., including the data and the destinationaddress) to the router 400B.

In one or more embodiments, the routers include functionality to sendthe packet in a direction toward the physical, diagramic, orarchitectural location corresponding to the (physical) destinationaddress (while in some embodiments, a direction advantageous fordelivery to the destination address which in some cases may not betoward the diagramic/architectural/physical direction of thedestination). For example, the router 400B reads the packet'sdestination address and determines in which direction, and thereby viawhich output port, to send the packet. Because the core network may usecontinuous physical addressing (e.g., scratchpads with continuousphysical addressing across adjacent cores, chips with continuousphysical addressing across adjacent chips), the routers may require lesscomplexity and/or logic to determine in which direction to send packetsas compared to virtual addressing.

For example, based on the location of the router 400B in the network andthe (physical) destination address of a packet, the router 400B candetermine whether the destination address is north, west, south, east,or the core 400A of the router 400B. In one example, if the locationcorresponding to the destination address is southeast of the router400B, the router 400B may simply send the packet eastward (e.g., towardthe router 410B) or southward (e.g., toward the router 401B). The router400B may implement an output port selection policy to select which portto utilize first. For example, according to a core first, then east,then south, then west, then north policy, the router 400B may first sendthe packet eastward before sending southward, because the east directionis of higher priority. It should be appreciated that embodiments supportother output port selection policies.

The next routers that receive the packet may perform the same processuntil the packet reaches the destination. For example, if the router410B receives a packet from the router 400B, the router 410B may readthe packet's destination address and determine in which direction tosend the packet according to the physical addressing. For example,southward toward the router 411B if the physical address corresponds toa location southward, eastward toward an easterly router (not shown) ifthe physical address corresponds to a location eastward, or eastwardtoward an easterly router (not shown) if the physical addresscorresponds to a location southeastward (if implementing the output portselection policy discussed above). If the packet's destination addresscorresponds to the associated core 410A and/or an internal core memoryaddress (e.g., the core 410A's scratchpad memory), the router 410B willsend the packet to the core 410A.

In one or more embodiments, the routers include functionality toimplement a deterministic routing policy, such as a static priorityrouting policy. The static priority routing policy may assign staticpriority to designated input ports of a router. For example, the router400B may receive two or more packets (e.g., from other routers or thecore 400A) to be sent through the same output port of the router 400B(i.e., in the same direction or through the same output port). If thetwo or more packets are ready to be sent through the same output port, aconflict arises because the (“conflicted” or “flooded”) output port mayonly be able to send the packet of one input port at a time. In one ormore embodiments, the input ports receive the two or more packets on thesame clock cycle (e.g., simultaneously).

In this case, the router may implement a static priority routing policywhere input ports are assigned priority levels that do not change (e.g.,because they are represented by hardware logic), and therefore thepriority assignment is static. For example, the highest priority may beassigned to the north input port, then west input port, then south inputport (i.e., the port corresponding to the buffer 401N), then east inputport (i.e., the port corresponding to the buffer 410W), then the core's400A input port. As a result, the router 400B may first send packetsfrom the north input port through the conflicted output port until thereare no more packets from the north input port, then from the west inputport until there are no more packets from the west input port and whilethere are no new packets from the north input port, and so on.

Accordingly, the packets received at input ports with less priority mayremain at those input ports (e.g., at the corresponding input portbuffer) until there are no more packets from input ports with higherpriority to be sent on through the conflicted output port. For example,consider the case where there is a first packet from the north inputport of the router 400B that is to be routed southward toward the router401B, and at the same time there is a second packet from the east inputport of the router 400B (i.e., the port corresponding to the buffer410W, from the router 410B) that is also to be routed southward towardthe router 401B. The router 400B may give priority to the first packetfrom the north input port to be sent southward first. Meanwhile, thesecond packet from the east input port would remain stalled at thebuffer 410W. If the north input port of the router 400B (or any otherinput port of the router 400B with higher priority than the east inputport) continue(s) to provide packets to be routed southward, the secondpacket from the east input port will remain stalled at the buffer 410Wuntil all packets from higher priority input ports have been routedalong.

Continuing the example, other packets that are to be sent on stalledlines will also be stalled until the stalled lines are no longerstalled. Consider the case where there is also a third packet from therouter 411B that is to be routed to the router 410B, and then from therouter 410B to the router 400B. If the second packet is stalled at thebuffer 410W, then the third packet will be stalled at a buffer 411Nuntil the second packet can continue passed the buffer 410W. If thereare other packets that are to travel from the router 410B to the router400B, and/or other packets that are to travel from the router 411B tothe router 410B, those packets will also be stalled until the stalledlines are no longer stalled. As a result, “back pressure” formed bystalled packets may form until the lines in their travel path are nolonger stalled.

In one or more embodiments, the input port priority for a router neverchanges, and for that reason is static. In other words, if the priorityis in the order of north, then west, then south, then east, and thencore, the north input port will always have priority over all otherinput ports, the west input port will always have priority over allremaining input ports, and so on. Such a routing policy is deterministicbecause for every state (of combinations of data packets at differentports of routers), the following state may be determined. In one or moreembodiments, all routers of a core network implement the same staticinput port priority protocol.

In one or more embodiments, a buffer does not exist between a core andits corresponding router. As a result, if a packet sent by the core isstalled at the router in favor of an input port with higher priority,the execution at the core may be stalled indefinitely until the packetis sent on.

In addition, a core may handle an incoming packet from the router whenthe packet arrives (stalling execution in the core if a hazard wouldoccur). Data packet traffic of the routers may have priority over coretraffic. For example, if a data packet sent from a core's router to thatcore is to be written to the scratchpad memory of the core, that writeoperation will supersede all other core operations. Accordingly, in oneor more embodiments, the overall execution of the cores in a network,and data packet traffic, will not be stalled due to traffic caused bycores that are busy executing other operations instead of acceptingincoming data packets. In other words, some sort of progress may be madeevery clock cycle until no in-transit packets remain.

In one or more embodiments, the routers may be operable to communicatewith neighboring routers to indicate whether the routers' input portsare stalled. For example, if a router indicates that a particular inputport is stalled, the neighboring router will retain a packet that is tobe transmitted to that input port. If a router indicates that aparticular input port is not stalled, the neighboring router willtransmit the packet to that input port.

The static priority routing policy can be described from the perspectiveof the router output ports. For example, consider the priority schedulediscussed above (i.e., north, west, south, east, core). For each cycle,the router (or a particular output port) may determine if there is apacket at the highest priority input port (i.e., the north input port)that is to be transmitted through the particular output port. If so,then the particular output port will transmit that packet. If not, therouter may determine if there is a packet at the next highest priorityinput port (i.e., the west input port) that is to be transmitted throughthe particular output port. If so, then the particular output port willtransmit that packet. If not, the router will continue the process untila packet that is to be transmitted through the particular output port isfound or all input ports have been checked. The router may perform thisprocess for each output (or, each output port may perform this process).

In one or more embodiments, the router (or the particular output port)may not check the input port associated with an output port for a packetto be transmitted through the particular output port, thereby omitting astep that may not be necessary in some embodiments. For example, for awest output port, the router may not check the west input port for apacket to be transmitted through the west output port because a packettraveling eastward would not travel westward. In other words, a packetwill not travel in a reverse direction.

A static priority routing policy may require hardware design that issimpler than other designs and does not require retaining a state ofsome number of cycles of history. In addition, a static priority routingpolicy may be simpler to describe in software using bitmasks. Further, astatic priority routing policy may be statically decidable at compiletime, a consequence of which is that within a compile unit, a network ofcores can be guaranteed to be deadlock-free so long as all sendsequences halt (e.g., an off-core store instruction). If a compileroptimizes for all cores in a network, guarantees can be made on packettraffic within that network. And, for any given model of parallelism, acompiler may explicitly describe the priority of a concurrent thread'snetwork access by its location within the network.

It should be appreciated that a static priority routing policy is notlimited to the priority schedule discussed above (i.e., north, west,south, east, core). For example, a static priority routing policy couldimplement one of the following priority schedules:

north, east, south, west, core;

west, south, east, north, core;

north, south, west, east, core;

core, north, west, south, east; or

any other permutation of input port priority schedules.

In one or more embodiments, when there are no stalled lines in thetravel path of a packet, the architecture 499 can guarantee that thepacket will travel between two routers in one cycle. For example, apacket sent from the router 400B (e.g., from the buffer 400E) can reachthe router 410B in one cycle. In one or more embodiments, when there areno stalled lines in the travel path of a packet, the architecture 499can guarantee that the packet will travel from a first core to anadjacent core in two cycles. For example, a packet sent from the core400A to the core 410A can reach the router 410B in a first cycle. Thismay be because a load store unit of the core 400A (e.g., the LS1 324 ofFIG. 3) may be or may function similarly to an output buffer between thecore 400A and the router 400B (e.g., the buffer 400E), similar to thebuffers 400N, 400W, or 400S. The packet can then reach the core 410A(e.g., the inbox 326 of FIG. 3) in a second cycle.

FIG. 5 shows a flowchart of a method for routing data packets accordingto a static priority routing policy (e.g., in a network-on-chiparchitecture). While the various steps in this flowchart are presentedand described sequentially, one of ordinary skill will appreciate thatsome or all of the steps can be executed in different orders and some orall of the steps can be executed in parallel. Further, in one or moreembodiments, one or more of the steps described below can be omitted,repeated, and/or performed in a different order. Accordingly, thespecific arrangement of steps shown in FIG. 5 should not be construed aslimiting the scope of the invention.

In STEP 502, a first data packet including a data payload and a physicaldestination address is received at a router via a first input port ofthe router. For example, with reference to FIG. 4, a first data packetmay be received at the west input port of the router 400B. The firstdata packet may include a data payload (e.g., information, data,instructions, etc.) and a physical destination address (e.g., adestination memory location, a destination router, a destination core,etc.).

In STEP 504, an output port for sending the first data packet based onthe physical destination address is selected. Continuing the example, itmay be determined that the first data packet is to be sent on via thesouth output port of the router 400B (through the buffer 400S) to therouter 401B (e.g., if the physical destination address is south of therouter 400B).

In STEP 506, a second data packet received at a second input port of therouter is determined to be sent on the output port. Continuing theexample, a second data packet may be received at the north input port ofthe router 400B (e.g., at the same time and/or on the same clock cycleas the receipt of the first data packet). Based on the physicaldestination address of the second data packet, it may be determined thatthe second data packet is also to be sent on via the south output portof the router 400B to the router 401B (e.g., if the physical destinationaddress is south of the router 400B).

In STEP 508, a static priority routing policy to determine that thesecond data packet has priority over the first data packet based on apriority of the second input port over the first input port is applied.Continuing the example, a north, west, south, east, core static priorityrouting policy may be applied to determine that the second data packetfrom the north input port has priority over the first data packet fromthe west input port.

In STEP 510, the first data packet is sent on the output port after thesecond data packet and any other data packets subsequently andconsecutively received at the second input port are sent. Continuing theexample, the second data packet may be sent on via the south output portof the router 400B before the first data packet is sent on via the southoutput port of the router 400B. Further, if there were subsequent andconsecutive data packets arriving at the north input port of the router400B, those data packets may be first sent on via the south output portof the router 400B before the first data packet is sent on.

FIG. 6 shows example tiles of a multi-core processor network-on-chiparchitecture 699, in accordance with one or more embodiments. In one ormore embodiments, the architecture 699 includes one or more tiles600-633. The tiles 600-633 may be the same as or similar to the tiles200-233 of FIG. 2. For example, the tile 600 may be the same as the tile200, the tile 601 may be the same as the tile 201, the tile 610 may bethe same as the tile 210, and so on. Accordingly, each tile may includea core and router pair and be communicatively coupled with adjacenttiles (e.g., that are diagramically/architecturally/physically eitherabove, below, to the left of, and/or to the right of the tile) in a gridconfiguration, thereby forming a “network” of tiles. In another example,at least some of the tiles 600-633 may be the same as or similar to thetiles of FIG. 4. For example, the tile 600 could be the same as orsimilar to the tile 400 (i.e., including core 400A and router 400B), thetile 601 could be the same as or similar to the tile 401 (i.e.,including core 401A and router 401B), the tile 610 could be the same asor similar to the tile 410 (i.e., including core 410A and router 410B),and the tile 611 could be the same as or similar to the tile 411 (i.e.,including core 411A and router 411B).

In one or more embodiments, an optimization module includesfunctionality to assign processes (or functions) of an application to beexecuted by a multi-core processor to tiles of the multi-core processorso as to optimize execution of the application in accordance with thestatic priority routing policy. For example, a user application may bereceived (e.g., in the form of source code, assembly code, or machine)with identification of one or more high priority functions. The highpriority functions may be assigned to one or more particular tiles totake advantage of determinism guaranteed by aspects of the architecturediscussed herein. For example, a static priority routing policy maycause network-on-chip traffic patterns or execution that aresubstantially or fully deterministic. The deterministic property can berelied upon at compile time to assigned processes to tiles. It should beappreciated that in some embodiments, optimizing execution of theapplication may not achieve mathematically optimal execution, butotherwise improve or substantially optimize the execution.

Determinism can be guaranteed on a system where the network-on-chipbehavior (including packet latency, transmission order, and direction)can be known prior to execution, generally at compile time. Determinismcan be guaranteed for at least a region of the network-on-chip (e.g., aset of adjacent tiles). However, determinism may not be guaranteed if,for example, a burst of packets arrive from another chip or “rogue”packets arrive from cores outside of the region. Nevertheless, even insuch cases determinism can be substantially or fully guaranteed whenfurther information is known or assumed about the system (e.g., knowingwhere the store instruction trying to use the network-on-chip is loaded(the source tile) and the address it is trying to store to (thedestination tile)).

It should be understood that identification of a high priority functionmay not necessarily be received, but instead identification thereofdetermined through analysis and/or simulation of the user application.In one or more embodiments, a high priority function may be one that isessential to the execution of the application, for which responsive/fastexecution of is required/preferred, that causes a high amount ofoutgoing data packets, and/or any other factor making the executionthereof important with respect to other functions.

For example, referring to FIG. 6, consider the case where the tiles600-633 implement a north, west, south, east, core static priorityrouting policy (i.e., where the north input ports are assigned thehighest priority, then the west input ports, and so on). Accordingly,data packets sent by tiles that are more northward will have higherpriority over data packets sent by tiles that are more southward. Forexample, data packets from the tile 600 sent to the tile 601 will havepriority over data packets from the tile 611 sent to the tile 601(because data packets from the tile 600 will be received at the northinput port of the tile 601, which has higher priority than data packetsreceived at the east input port of the tile 601). For this reason, themore north a tile is located in the grid, the more priority outgoingdata packets of the tile will receive.

Further, data packets sent by tiles that are more westward will havehigher priority over data packets sent by tiles that are more eastward.For example, data packets from the tile 600 sent to the tile 610 willhave priority over data packets from the tile 611 sent to the tile 610(because data packets from the tile 600 will be received at the westinput port of the tile 610, which has higher priority than data packetsreceived at the south input port of the tile 610). For this reason, themore west a tile is located in the grid, the more priority outgoing datapackets of the tile will receive.

For these reasons, the more northwest a tile is located in the grid, themore priority outgoing data packets of the tile will receive (e.g.,outgoing data packets of the tile 600 are provided the highest priorityas they travel south and/or west). Consequently, the more southeast atile is located in the grid, the more priority outgoing data packets ofthe tile will receive (e.g., outgoing data packets of the tile 600 areprovided the highest priority as they travel north and/or east).

Accordingly, a function that is of high priority may be assigned to oneor more tiles located in an area of the grid with higher routingpriority (e.g., more north and/or west in the example above) so as tooptimize execution of the application and/or high priority function inaccordance with the static priority routing policy. For example, afunction that produces a high amount of outgoing data packets may beassigned to the tile 600, the tile 610, or a group of tiles 650 (whichinclude the tiles 600, 601, 610, and 611), which may provide optimaloutgoing data packet priority. Consequently, low priority functions orfunctions with a low amount of outgoing packets may be assigned to tileslocated in an area of the grid with lower routing priority (e.g., moresouth and/or east in the example above). For example, a function thatproduces a low amount of outgoing data packets may be assigned to thetile 633, the tile 613, or a group of tiles 670 (which include the tiles603, 613, 623, and 633).

In another example, a function may be of high priority in terms ofreceiving packets (e.g., it is important that the function receive dataquickly). Such a function may be assigned to one or more tiles locatedin an area of the grid with “lower” routing priority (e.g., more southand/or east in the example above) so as to optimize execution of theapplication and/or high priority function in accordance with the staticpriority routing policy. Even though the function is assigned to a“lower” routing priority area, packets may be routed to the functionmore quickly. In another example, a function may be of high priority interms of providing packets to or receiving packets from a peripheralexternal to the grid. Such a function may be assigned to one or moretiles located in an area of the grid more proximate to an input/outputblock associated with the peripheral.

In one or more embodiments, one or more functions may be assigned togroups of tiles so as to optimize execution of the application and/orthe functions in accordance with the static priority routing policy. Forexample, consider the case where two functions frequently, consistently,or often communicate with one another (unilaterally or bilaterally). Tooptimize execution, two functions may be assigned to groups of tilesthat are proximate. For example, the two functions may be assigned tothe group of tiles 650 and a group of tiles 660 (which include the tiles620-622).

Further, the two functions may be assigned to groups of tiles based onwhich function sends more data packets to the other and/or whichfunction is of higher priority. For example, the function that sendsmore packets (and/or of higher priority) may be assigned to the group oftiles 650 and the function that receives more packets (and/or of lowerpriority) may be assigned to the group of tiles 660. Accordingly,packets sent from the group of tiles 650 toward the group of tiles 660will have higher priority than packets sent from the group of tiles 660toward the group of tiles 650.

In one or more embodiments, a function may be assigned to a group oftiles with a particular configuration or arrangement so as to optimizeexecution of the application and/or the function in accordance with thestatic priority routing policy. For example, a function may executeoptimally when executed by a group of tiles in a square configuration(e.g., like the group of tiles 650). In another example, a function mayexecute optimally when executed by a group of tiles in a linearconfiguration (e.g., like the group of tiles 660 or 670).

In one or more embodiments, the optimization module includesfunctionality to determine optimal assignment configurations offunctions to tiles of the multi-core microprocessor chip. For example,execution of different configurations of a set of functions may besimulated on a multi-core microprocessor chip (or a software modelthereof).

The multi-core microprocessor chip may include a set of tiles arrangedin a grid configuration (e.g., much like FIGS. 2, 4, and 6). Thedifferent configurations may include execution of the set of functionsby different groups of tiles. For example, execution of a particularfunction may be simulated when assigned to the group of tiles 650 andagain when assigned to the group of tiles 670.

Further, different combinations of other functions may be simulated withthe simulations of the particular function. For example, while theparticular function may be simulated when assigned to the group of tiles650, a second function may be simulated when assigned to the group oftiles 660, then again when the second function may be simulated whenassigned to the group of tiles 630-632, and so on. Then while theparticular function may be simulated when assigned to the group of tiles670, the second function may be again simulated while assigned todifferent groups of tiles, and so on. In this way, differentcombinations of configurations may be simulated. It should beappreciated that traffic patterns of particular functions may be knownfrom previous simulations. Accordingly, simulation of those particularfunctions may not be necessary.

The network traffic patterns of the execution of the differentconfigurations may be monitored and ranked according to rankingcriteria. The ranking criteria are used to rank each of the differentconfigurations based on the network traffic patterns corresponding toeach configuration. An optimal configuration of the differentconfigurations may be selected based on the ranking.

FIG. 7A shows a flowchart of a method for assigning functions of anapplication to processor tiles so as to optimize execution of theapplication in accordance with a static priority routing policy (e.g.,in a multi-core processor). While the various steps in this flowchartare presented and described sequentially, one of ordinary skill willappreciate that some or all of the steps can be executed in differentorders and some or all of the steps can be executed in parallel.Further, in one or more embodiments, one or more of the steps describedbelow can be omitted, repeated, and/or performed in a different order.Accordingly, the specific arrangement of steps shown in FIG. 7A shouldnot be construed as limiting the scope of the invention.

In STEP 702, a user application is received, where the user applicationincludes a set of functions. For example, the user application may bedirected to an automobile control system including driverless carfunctions, climate control functions, media entertainment functions,etc.

In STEP 704, execution of different configurations of the set offunctions is simulated on a multi-core microprocessor chip (e.g., themulti-core processor network-on-chip architecture 699 of FIG. 6), wherethe multi-core microprocessor chip includes a set of tiles arranged in agrid configuration (e.g., the tiles 600-633), where each tile includes aprocessor core and a corresponding router, where each router iscommunicatively coupled with at least one other router to form anetwork-on-chip and each router implements a deterministic staticpriority routing policy. And the different configurations includeexecution of the set of functions by different groups of tiles.

Continuing the example, the functions of the automobile control systemmay be executed by different configurations of the tiles 600-633. Forexample, a first configuration may include execution of the driverlesscar functions by the group of tiles 650, the climate control functionsby the group of tiles 660, and the media entertainment functions by thegroup of tiles 670. A second configuration may include execution of thedriverless car functions by the group of tiles 660, the climate controlfunctions by the group of tiles 670, and the media entertainmentfunctions by the group of tiles 650. A third configuration may includeexecution of the driverless car functions by the group of tiles 670, theclimate control functions by the group of tiles 650, and the mediaentertainment functions by the group of tiles 660.

In STEP 706, network traffic patterns of the execution of the differentconfigurations are monitored. Continuing the example, the networktraffic patterns of each configuration of the automobile control systemthrough the network-on-chip architecture 699 may be monitored.

In STEP 708, the different configurations are ranked according toranking criteria, where the ranking criteria is used to rank each of thedifferent configurations based on the corresponding network trafficpatterns. Continuing the example, the first, second, and thirdconfigurations may be ranked based on the traffic patterns of eachconfiguration implemented on the network-on-chip architecture 699.

In STEP 710, an optimal configuration of the different configurations isselected based on the ranking. Continuing the example, the optimalconfiguration of the first, second, and third configurations is selectedfor implementation.

FIG. 7B shows a flowchart of a method for assigning functions of anapplication to processor tiles so as to optimize execution of theapplication in accordance with a static priority routing policy (e.g.,in a multi-core processor). While the various steps in this flowchartare presented and described sequentially, one of ordinary skill willappreciate that some or all of the steps can be executed in differentorders and some or all of the steps can be executed in parallel.Further, in one or more embodiments, one or more of the steps describedbelow can be omitted, repeated, and/or performed in a different order.Accordingly, the specific arrangement of steps shown in FIG. 7B shouldnot be construed as limiting the scope of the invention.

In STEP 752, a user application is received. For example, the userapplication may be directed to an automobile control system includingdriverless car functions, climate control functions, media entertainmentfunctions, etc. The user application may include a set of functions(e.g., the automobile control system's functions) to be executed by amulti-core microprocessor chip (e.g., the multi-core processornetwork-on-chip architecture 699 of FIG. 6), where the multi-coremicroprocessor chip includes a set of tiles each including a processorcore and a corresponding router (e.g., the tiles 600-633), where eachrouter is communicatively coupled with at least one other router to forma network-on-chip grid and each router implements a deterministic staticpriority routing policy.

In STEP 754, an identification of a high priority function of the set offunctions is received. Continuing the example, the user application (oranother source) may indicate that the driverless car functions are highpriority functions. Degrees of priority may be identified, e.g., thatthe driverless car function(s) are of higher priority than the mediaentertainment function(s), which are in turn of higher priority than theclimate control function(s). In some embodiments, sub-function levels ofpriority may be identified (e.g., a subset of sub-functions of thedriverless car functions are of higher priority than another subset ofsub-functions of the driverless car functions and/or a subset ofsub-functions of the media entertainment functions).

In STEP 756, one or more tiles with high routing priority are identifiedaccording to the static priority routing policy. Continuing the example,if a north, then west, then south, then east, and then core staticpriority routing policy is implemented, more northwesterly tiles may beidentified as having high routing priority compared to moresoutheasterly tiles, for example.

In STEP 758, execution of the high priority function is assigned to theone or more tiles with high routing priority. Continuing the example,the high priority driverless car functions may be assigned to morenorthwesterly tiles (or any other tiles for which facilitate optimizedexecution of the driverless car functions).

FIGS. 8A-8E show example instruction words, in accordance with one ormore embodiments. The instruction words may be described as Very LongInstruction Words (VLIW). VLIWs allow a processor architecture to takeadvantage of instruction level parallelism (ILP). Conventional processorarchitectures allow programs to specify instructions that will beexecuted in sequence. However, a VLIW architecture allows programs toexplicitly specify instructions that will be executed in parallel. As aresult, VLIW architecture allows higher performance without the inherentcomplexity of some other approaches.

In one or more embodiments, a processor core (e.g., the core 300A) or acomponent thereof (e.g., the fetch unit 320) may receive or access aVLIW. The VLIW may be used to instruct components of the processor core(e.g., components of the core 300A) to perform operations in accordancewith particular operands.

Referring to FIG. 8A, a VLIW 800A is shown. The VLIW 800A includes 64bits, but it should be appreciated that embodiments support other bitlengths (e.g., 32 bits, 80 bits, 128 bits, etc.). The bits of the VLIW800A may be logically grouped into different instruction “slots”, forexample, the slots 800A1-800A4. Each slot may represent an instructionto a functional unit of a processor, or “slot instruction” (e.g., to thefunctional units of the processor core 300A of FIG. 3). For example, theslots 800A1-800A4 may include instructions for the FPU 316, LS0 322, LS1324, and the ALU 310, respectively.

Each slot instruction may include one or more fields. For example, theslot 800A1 may include an opcode field 801 and value fields 802-804, theslot 800A2 may include value fields 805-807 and an opcode field 808, theslot 800A3 may include an opcode field 809 and value fields 810-812, andthe slot 800A4 may include value fields 813-814 and an opcode field 815.An opcode field may indicate a particular operation to be executedinvolving the value fields of the same instruction. For example, theopcode 801 may indicate an operation to be executed involving registersdesignated by the value fields 802-804. A value field may indicate whichregister contains an operand related to the operation (e.g., via amemory address value), to which register to store a resulting value ofthe operation (e.g., via a memory address value), or other valuesrelated to the operation (e.g., address offsets, immediate values,flags, etc.).

In one or more embodiments, different instructions in a VLIW may includea different number of fields for a particular functional unit. Forexample, the VLIW 800A may represent the number of fields for aparticular set of slot instructions. More specifically, the slot 800A1may include four fields, the slot 800A2 may include four fields, theslot 800A3 may include four fields, and the slot 800A4 may include threefields. Meanwhile, referring to a VLIW 800B shown by FIG. 8B, a slot800B1 may include five fields (not four fields), a slot 800B2 mayinclude three fields (not four fields), a slot 800B3 may include threefields (not four fields), and a slot 800B4 may include four fields (notthree fields), where the slots 800B1-4 may correspond to the samefunctional units as the slots 800A1-4, respectively.

For example, while the slot instruction represented by the slot 800A1may require an opcode and only three value fields, the slot instructionrepresented by the corresponding slot 800B1 may require an opcode andfour value fields. In order to accommodate the instruction length of theslot instruction of the slot 800B1, the length of the slot 800B1 mayincrease beyond the length of the corresponding slot 800A1. As a result,the slot 800B1 may extend into an area of allocable bits that are partof the slot 800A2 in FIG. 8A. As a result, the length of the slot 800B2may be decreased as compared to the length of the corresponding slot800A2, because allocable bits that represented a slot instruction of theslot 800A2 in one VLIW configuration are allocated to a slot instructionof the slot 800B1 in another VLIW configuration.

However, the slot instruction of the slot 800B2 may require an opcodefield and only two value fields. As a result, even though the slot 800B1has claimed a portion of bits that are part of an adjacent slot for aparticular combination of slot instructions (and/or slot opcodes), theslot 800B2 may include enough bits and/or fields to properly represent aslot instruction.

In one or more embodiments, the instruction set architecture may preventconflicting combinations where adjacent slot instructions would bothrequire particular bits of the VLIW. For example, a processor maydisallow a slot instruction represented by the slot 800B1 to be pairedwith a slot instruction represented by the slot 800A2, where both slotinstructions would require some of the same bits. A particular slotinstruction for a particular slot may use more or less bits depending onwhich other slot instructions the particular slot instruction is pairedwith. The legal and illegal combinations may be determined based on theparticular combination of slot opcodes (the opcodes of each slot).

It should be appreciated that in one or more embodiments, an instructionslot may extend into allocable bits that are not adjacent to theinstruction slot. For example, instead of extending into allocable bitsof the slot 800A2, the slot 800A1 may extend into allocable bits of theslot 800A3 or the slot 800A4.

Referring to FIG. 8B, the VLIW 800B may store a particular instructionword represented by the following instruction notation:

FMADD, f2, f4, f5, f6|0, r5, f3, LWLF SWOF, f2, r4, 0|r3, r2, r2, AND

The instruction word will be discussed with reference to the processorcore 300A of FIG. 3, but it should be appreciated that embodiments arenot limited to core 300A. Fields leading with the letter “f” may denotea floating point register (e.g., stored in the FRF 314) and fieldsleading with the letter “r” may denote an integer register (e.g., storedin the GRF 312).

The slot instruction “r3, r2, r2, AND” may be represented by the slot800B4, where fields of the slot instruction notation correspond to thefields of the slot 800B4. For example, the “AND” portion may correspondto the opcode 835 and the “r3, r2, r2” portions may correspond to thevalues 832-834, respectively. For example, the opcode 835 may indicatethat the ALU 310 is to execute a logical bitwise “AND” operation usingthe values stored in registers r2 and r3, and to write the resultingvalue to register r2.

The slot instruction “SWOF, f2, r4, 0” may be represented by the fieldsof the slot 800B3. For example, the “SWOF” portion (which may representa “store word” operation) may correspond to the opcode 829 and the “f2,r4” portions may correspond to the values 830-831, respectively. Theopcode 829 may indicate that the LS1 324 is to write the value stored inregister f2 to a memory location represented by the value stored inregister r4.

Slots of some VLIWs may include a particular number of fields dependingon the particular slot instruction. For example, the third slot mayinclude four fields (e.g., the slot 800A3) for one slot instruction thatmay use or require four fields, while the third slot includes threefields (e.g., the slot 800B3) for a different slot instruction that mayuse or require three fields.

Slot instructions of some VLIWs may include a particular number offields depending on the particular combination of slot instructions(e.g., based on the combination of slot opcodes). For example, aparticular slot instruction for a particular slot may use more or lessbits depending on which other slot instructions the particular slotinstruction is paired/grouped with. In one example, the third slot ofboth the VLIWs 800A and 800B (i.e., the slots 800A3 and 800B3,respectively) may include the same opcode indicating the same type ofoperation. However, based on the combination of other opcodes in theVLIW, the slot 800A3 may include more fields and/or bits than the slot800B3.

Accordingly, in the example discussing the particular VLIW above, thenotation “SWOF, f2, r4, 0” includes an immediate value in the last field(i.e., an immediate “0”) that will not be used in the actual VLIW,because in this particular combination of slot instructions, therelevant bits are included in the “AND” operation. However, in otherslot instruction combinations, an immediate value in the last field ofthe “SWOF” slot instruction may be included in the VLIW and therebyinvolved in the operation of the “SWOF” slot instruction.

The slot instruction “0, r5, f3, LWLF” may be represented by the fieldsof the slot 800B2. For example, the “LWLF” portion (which may representa “load word” operation) may correspond to the opcode 828 and the “r5,f3” portions may correspond to the values 826-827, respectively. Theopcode 828 may indicate that the LS0 322 is to write the value stored inregister r5 to register f3.

For similar reasons with respect to the slot 800B3, the notation “0, r5,f3, LWLF” for the slot 800B2 includes an immediate value in the firstfield (i.e., an immediate “0”) that will not be used in the actual VLIW.Instead, the relevant bits are included in the “FMADD” operation.

The slot instruction “FMADD, f2, f4, f5, f6” may be represented by thefields of the slot 800B1. For example, the “FMADD” portion maycorrespond to the opcode 821 and the “f2, f4, f5, f6” portions maycorrespond to the values 822-825, respectively. The opcode 821 mayindicate that the FPU 316 is to perform a fused multiply-add operationusing the values stored in registers f4, f5, and f6, and to write theresulting value to register f2. For example, the FMADD operationincludes multiplying the values stored in registers f4 and f5, addingthe resulting product with the value stored in register f6, and writingthe resulting value to register f2.

For the particular combination of slot opcodes for the particularexample VLIW, the first slot of the VLIW 800B (i.e., the slot 800B1) mayinclude more bits from an adjacent slot as compared to the first slot ofthe VLIW 800A (i.e., the slot 800A1). As a result, the “FMADD” slotinstruction may include five fields (as opposed to four fields).

Performing a fused multiply-add operation is important, advantageous,and/or preferable for many operations in computing. In mostarchitectures, a multiply operation requires 3 cycles to execute and anadd operation requires 1 cycle to execute. Accordingly, in mostarchitectures, a fused multiply-add combination of operations requires atotal of 4 cycles to execute (3 cycles for a multiplication operationand 1 cycle for an addition operation). However, the architecturecorresponding to one or more embodiments is capable of completing oneFMADD operation in a total of 3 cycles. Accordingly, indicating an FMADDoperation is to be executed, in one instruction, is advantageous in someembodiments.

Such an FMADD operation may require five fields (one opcode, threeoperands fields, and one destination field). Embodiments allow forincluding or reallocating bits of an instruction to a particular slotfrom another slot to allow for longer slot instructions (e.g., fivefields for an FMADD operation). Meanwhile, the adjacent slot may stillbe used to provide useful instructions to another functional unit,thereby avoiding a loss of performance with respect to other functionalunits or operations.

Referring to FIG. 8C, a VLIW 800C may store a particular instructionword represented by the following instruction notation:

FMUL, f2, f4, f5|−3, r5, f3, LWLF SWOF, f2, r4, 0|5, r3, r2, ADDI

The slot instruction “5, r3, r2, ADDI” may be represented by a slot800C4, where fields of the instruction notation correspond to the fieldsof the slot 800C4. For example, the “ADDI” portion may correspond to theopcode 855 and the “5, r3, r2” portions may correspond to the values852-854, respectively. The opcode 855 may indicate that the ALU 310 isto execute an “add immediate unsigned” operation using the value storedin the register r3 and the immediate value of ‘5’, and to write theresulting value to register r2.

Similarly, the slot instruction “SWOF, f2, r4, 0” may be represented bythe fields of the slot 800C3. For example, the “SWOF” portion maycorrespond to the opcode 849 and the “f2, r4” portions may correspond tothe values 850-851, respectively. The opcode 849 may indicate that theLS1 324 is to write the value stored in register f2 to a memory locationrepresented by the value stored in register r4. The third slot of someinstruction words may include four fields (e.g., the slot 800A3).

The slot instruction “−3, r5, f3, LWLF” may be similar to the slotinstruction “0, r5, f3, LWLF” (discussed above). However, a nonzerosigned immediate offset (i.e., “−3”) is included. Because the slotinstruction “−3, r5, f3, LWLF”, corresponding to the second slot (theslot 800C2), includes a total of four fields, the slot instructioncorresponding to the first slot (the slot 800C1) may not include enoughbits to provide five total fields (e.g., like the slot 800B1 of FIG.8B). As a result, the slot instruction corresponding to the first slot(the slot 800C1) may not include a five-field slot instruction (e.g.,like the FMADD slot instruction). However, a four-field slot instructionmay be included, like “FMUL, f2, f4, f5”.

In one or more embodiments, the processor architecture avoids hazards byimplementing a static scheduling policy. One example of a data hazard isa RAW (Read-After-Write) hazard, where a value is read from a registerafter a value is written to that register. This hazard occurs when a“read” operation uses an outdated value due to the writeback latency ofa “write” operation. The VLIW architecture may implement staticscheduling to prevent such hazards.

Consider again the particular instruction word represented by thefollowing instruction notation:

FMADD, f2, f4, f5, f6|0, r5, f3, LWLF SWOF, f2, r4, 0|r3, r2, r2, AND

The slot instruction “FMADD, f2, f4, f5, f6” will result in a valuebeing written to the register f2. However, the slot instruction “SWOF,f2, r4, 0” involves reading a value that is stored by the register f2.If the FMADD operation writes to the register f2 before the SWOFoperation reads the value, then a RAW hazard will occur.

In one or more embodiments, the writeback stage (where values may bewritten to memory locations such as registers) occurssequentially/chronologically after the instruction decode stage (whereregister values are read). For that reason, continuing the example, thevalue from register f2 will be read for the SWOF operation representedin the slot 800B3 before a new value is written to register f2 by theFMADD operation represented in the slot 800B1.

In one or more embodiments, the Instruction Set Architecture (ISA) ofthe VLIW architecture avoids conflicts arising from read and write portrequirements while optimizing the number of ports necessary. Consideragain the particular instruction word represented by the followinginstruction notation:

FMADD, f2, f4, f5, f6|0, r5, f3, LWLF SWOF, f2, r4, 0|r3, r2, r2, AND

The entire instruction word requires:

4 general purpose register file read ports (2+1+1+0),

1 general purpose register file write ports (1+0+0+0),

4 floating point register file read ports (0 30 1+0+3), and

2 floating point register file write ports (0+0+1+1).

Register files (e.g., GRF 312 and FRF 314) with 6 64-bit read ports and2 64-bit write ports each will not cause a resource conflict. For thatreason, the port count required by the instruction word would not makethe instruction illegal.

Consider another VLIW, VLIW 800D of FIG. 8D, represented by thefollowing instruction notation:

NOP_F|2, r3, f5, LWLF|LDOF, f3, r2, 0|NOP_A

The slot instructions NOP_F and NOP_A may instruct functional units(e.g., an ALU and FPU) that no operation is to be executed by thosefunctional units.

The slot instruction “2, r3, f5, LWLF” may be represented by a slot800D2, where fields of the instruction notation correspond to the fieldsof the slot 800D2. For example, the “LWLF” portion may correspond to theopcode 868 and the “2, r3, f5” portions may correspond to the values865-867, respectively. The LWLF slot instruction may instruct afunctional unit to load a 64-bit word to a floating point register file(e.g., the FRF 314).

The slot instruction “LDOF, f3, r2, 0” may be represented by a slot800D3, where fields of the instruction notation correspond to the fieldsof the slot 800D3. For example, the “LDOF” portion may correspond to theopcode 869 and the “f3, r2” portions may correspond to the values870-871, respectively. The LDOF slot instruction may instruct afunctional unit to load a 128-bit double word to the same floating pointregister file (e.g., the FRF 314). As a result, even though no-operationinstructions such as NOP_F and NOP_A are included in the instructionword, the entire instruction word requires 3 64-bit floating pointregister file write ports to handle 64 bits+128 bits. For that reason,the instruction word is illegal due to a resource hazard if the floatingpoint register file only includes 2 write ports.

Consider another VLIW, VLIW 800E of FIG. 8E, represented by thefollowing instruction notation:

FSUB f4, f5, f6|LDLF, f3, r2, 0

The slot instruction “FSUB f4, f5, f6” may be represented by a slot800E1, where fields of the instruction notation correspond to the fieldsof the slot 800E1. For example, the “FSUB” portion may correspond to theopcode 881 and the “f4, f5, f6” portions may correspond to the values882-884, respectively. The FSUB slot instruction may instruct afunctional unit to load a 64-bit word to a floating point register file(e.g., the FRF 314).

The slot instruction “LDLF, f3, r2, 0” may be represented by a slot800E2, where fields of the instruction notation correspond to the fieldsof the slot 800E2. For example, the “LDLF” portion may correspond to theopcode 888 and the “f3, r2, 0” portions may correspond to the values885-887, respectively. The LDLF slot instruction may instruct afunctional unit to load a 128-bit double word to the same floating pointregister file (e.g., the FRF 314). Here, 192 bits are to be written tothe floating point register file (64 bits+128 bits) like the previousexample. However, here, the architecture pipeline design and schedulingmay be such that the execution of the FSUB operation requires one cyclefewer than the execution of the LDLF operation. As a result, theinstruction word does not exceed 2 write ports in any single cycle andno resource hazard exists.

It should be appreciated that in one or more embodiments, bits of anopcode field may be partially or fully allocable. For example, bits thatare used to represent an opcode in one VLIW may be used to representvalue fields in another VLIW. In another example, bits that are used torepresent an opcode in one VLIW may be used to augment another opcodefield in another VLIW. Conversely, bits that are used to represent avalue field in one VLIW may be used as opcode bits in another VLIW.

It should be appreciated that while FIGS. 8A-8D show 64-bit VLIWs with 4slots, embodiments support other VLIW lengths and arrangements. Forexample, such a VLIW could have a length of 16 bits, 32 bits, 48 bits,80 bits, 96 bits, 128 bits, or any other length. In another example, aVLIW could include 2 slots, 3 slots, 5 slots, and so on. It should alsobe appreciated that particular slots may or may not be dedicated toparticular functional units. For example, based on a particularindication (e.g., particular opcode(s)), slot 800A1 may includeinstructions for the FPU 316 and slot 800A4 may include instructions forthe ALU 310. But based on a different indication, slot 800A1 may includeinstructions for the ALU 310 and slot 800A4 may include instructions forthe FPU 316.

In one or more embodiments, the opcode fields in each slot may belocated such that they are at the ends of the VLIW and/or near themiddle of the VLIW. For example, referring to FIG. 8A, the opcode 801and the opcode 815 are located at edges of the slot 800A1, and theopcode 808 and the opcode 809 are located near the middle of the slot800A1 (i.e., bits 29-33 and bits 34-38, respectively). As a result, theopcode positions may be static and/or predictable. Meanwhile, the slotsmay expand and contract at the boundary between the slot 800A1 and 800A2and the boundary between the slot 800A3 and 800A4.

However, it should be appreciated that embodiments support otherdistributions of the opcode fields and value fields. In one example,each of the opcode fields may instead be located at the beginning ofeach respective instruction slot, while each of the value fields arelocated in the remainder of each respective instruction slot. In anotherexample, all of the opcode fields may instead be located at thebeginning of the VLIW (e.g., consecutively), while the value fields arelocated in the remainder of the VLIW.

FIG. 9 shows a flowchart of a method for implementing VLIWs (e.g., in aprocessor core). While the various steps in this flowchart are presentedand described sequentially, one of ordinary skill will appreciate thatsome or all of the steps can be executed in different orders and some orall of the steps can be executed in parallel. Further, in one or moreembodiments, one or more of the steps described below can be omitted,repeated, and/or performed in a different order. Accordingly, thespecific arrangement of steps shown in FIG. 9 should not be construed aslimiting the scope of the invention.

In STEP 902, a first very long instruction word (VLIW) including a setof slot instructions corresponding to a set of functional units isreceived. Each slot instruction may include an opcode identifying anoperation to be performed by the set of functional units and valuefields related to the operation, where a dedicated subset of the valuefields include dedicated bits dedicated to the slot instruction and anallocable subset of the value fields include allocable bits allocable toother slot instructions. For example, the VLIW 800A including a set ofslot instructions 800A1-800A4 corresponding to the functional units ofthe processor core 300A is received.

In STEP 904, the opcodes of each slot instruction are identified.Continuing the example, the opcodes 801, 808, 809, and 815 may beidentified.

In STEP 906, based on the opcodes, which allocable bits are allocated towhich slot instructions are determined. Continuing the example, it isdetermined to which slot the bits corresponding to value 805 areallocated (e.g., the second slot like slot 800A2 or the first slot likeslot 800B1).

In STEP 908, each functional unit is instructed to perform an operationidentified by a corresponding slot instruction using the correspondingdedicated bits and any allocable bits determined to be allocated to theslot instruction. Continuing the example, the functional units of theprocessor core 300A may be instructed to perform an operation based onthe opcodes 801, 808, 809, and 815 and the remaining bits, based ontheir allocation to which slot.

While the present disclosure sets forth various embodiments usingspecific block diagrams, flowcharts, and examples, each block diagramcomponent, flowchart step, operation, and/or component described and/orillustrated herein may be implemented, individually and/or collectively,using a wide range of hardware, software, or firmware (or anycombination thereof) configurations. In addition, any disclosure ofcomponents contained within other components should be considered asexamples because other architectures can be implemented to achieve thesame functionality.

The process parameters and sequence of steps described and/orillustrated herein are given by way of example only. For example, whilethe steps illustrated and/or described herein may be shown or discussedin a particular order, these steps do not necessarily need to beperformed in the order illustrated or discussed. Some of the steps maybe performed simultaneously. For example, in certain circumstances,multitasking and parallel processing may be advantageous. The variousexample methods described and/or illustrated herein may also omit one ormore of the steps described or illustrated herein or include additionalsteps in addition to those disclosed.

Embodiments may be implemented on a specialized computer system. Thespecialized computing system can include one or more modified mobiledevices (e.g., laptop computer, smart phone, personal digital assistant,tablet computer, or other mobile device), desktop computers, servers,blades in a server chassis, or any other type of computing device(s)that include at least the minimum processing power, memory, and inputand output device(s) to perform one or more embodiments.

For example, as shown in FIG. 10, the computing system 1000 may includeone or more computer processor(s) 1002, associated memory 1004 (e.g.,random access memory (RAM), cache memory, flash memory, etc.), one ormore storage device(s) 1006 (e.g., a hard disk, an optical drive such asa compact disk (CD) drive or digital versatile disk (DVD) drive, a flashmemory stick, etc.), a bus 1016, and numerous other elements andfunctionalities. The computer processor(s) 1002 may be an integratedcircuit for processing instructions. For example, the computerprocessor(s) may be one or more cores or micro-cores of a processor.

In one or more embodiments, the computer processor(s) 1002 may be anintegrated circuit for processing instructions. For example, thecomputer processor(s) 1002 may be one or more cores or micro-cores of aprocessor. The computer processor(s) 1002 can implement/execute softwaremodules stored by computing system 1000, such as module(s) 1022 storedin memory 1004 or module(s) 1024 stored in storage 1006. For example,one or more modules can be stored in memory 1004 or storage 1006, wherethey can be accessed and processed by the computer processor 1002. Inone or more embodiments, the computer processor(s) 1002 can be aspecial-purpose processor where software instructions are incorporatedinto the actual processor design.

The computing system 1000 may also include one or more input device(s)1010, such as a touchscreen, keyboard, mouse, microphone, touchpad,electronic pen, or any other type of input device. Further, thecomputing system 1000 may include one or more output device(s) 1012,such as a screen (e.g., a liquid crystal display (LCD), a plasmadisplay, touchscreen, cathode ray tube (CRT) monitor, projector, orother display device), a printer, external storage, or any other outputdevice. The computing system 1000 may be connected to a network 1020(e.g., a local area network (LAN), a wide area network (WAN) such as theInternet, mobile network, or any other type of network) via a networkinterface connection 1018. The input and output device(s) may be locallyor remotely connected (e.g., via the network 1020) to the computerprocessor(s) 1002, memory 1004, and storage device(s) 1006.

One or more elements of the aforementioned computing system 1000 may belocated at a remote location and connected to the other elements over anetwork 1020. Further, embodiments may be implemented on a distributedsystem having a plurality of nodes, where each portion may be located ona subset of nodes within the distributed system. In one embodiment, thenode corresponds to a distinct computing device. Alternatively, the nodemay correspond to a computer processor with associated physical memory.The node may alternatively correspond to a computer processor ormicro-core of a computer processor with shared memory and/or resources.

For example, one or more of the software modules disclosed herein may beimplemented in a cloud computing environment. Cloud computingenvironments may provide various services and applications via theInternet. These cloud-based services (e.g., software as a service,platform as a service, infrastructure as a service, etc.) may beaccessible through a Web browser or other remote interface.

One or more elements of the above-described systems may also beimplemented using software modules that perform certain tasks. Thesesoftware modules may include script, batch, routines, programs, objects,components, data structures, or other executable files that may bestored on a computer-readable storage medium or in a computing system.These software modules may configure a computing system to perform oneor more of the example embodiments disclosed herein. The functionalityof the software modules may be combined or distributed as desired invarious embodiments. The computer readable program code can be stored,temporarily or permanently, on one or more non-transitory computerreadable storage media. The non-transitory computer readable storagemedia are executable by one or more computer processors to perform thefunctionality of one or more components of the above-described systemsand/or flowcharts. Examples of non-transitory computer-readable mediacan include, but are not limited to, compact discs (CDs), flash memory,solid state drives, random access memory (RAM), read only memory (ROM),electrically erasable programmable ROM (EEPROM), digital versatile disks(DVDs) or other optical storage, and any other computer-readable mediaexcluding transitory, propagating signals.

It is understood that a “set” can include one or more elements. It isalso understood that a “subset” of the set may be a set of which all theelements are contained in the set. In other words, the subset caninclude fewer elements than the set or all the elements of the set(i.e., the subset can be the same as the set).

While the invention has been described with respect to a limited numberof embodiments, those skilled in the art, having benefit of thisdisclosure, will appreciate that other embodiments may be devised thatdo not depart from the scope of the invention as disclosed herein.

We claim:
 1. A system comprising: a computer processor; and anoptimization module executing on the computer processor and configuredto enable the computer processor to: receive a user application, whereinthe user application includes a set of functions; simulate execution ofdifferent configurations of the set of functions on a multi-coremicroprocessor chip, wherein: the multi-core microprocessor chipcomprises a set of tiles arranged in a grid configuration, wherein eachtile comprises a processor core and a corresponding router, wherein eachrouter: is communicatively coupled with at least one other router toform a network-on-chip, and implements the same deterministic staticpriority routing policy, wherein the deterministic static priorityrouting policy comprises assigning unchanging priority levels to theinput ports of the router and routing outbound data in accordance withthe unchanging priority levels, and the different configurations includeexecution of the set of functions by different groups of tiles; monitornetwork traffic patterns of the execution of the differentconfigurations; rank the different configurations according to rankingcriteria, wherein the ranking criteria is used to rank each of thedifferent configurations based on the corresponding network trafficpatterns; and select an optimal configuration of the differentconfigurations based on the ranking.
 2. The system of claim 1, whereinthe optimization module is further configured to enable the computerprocessor to receive an identification of a high priority function ofthe set of functions, wherein the ranking is based on optimal networktraffic patterns for the high priority function.
 3. The system of claim1, wherein the optimization module is further configured to enable thecomputer processor to determine a high traffic function of the set offunctions based on the monitoring, wherein the ranking is based onoptimal network traffic patterns for the high traffic function.
 4. Thesystem of claim 1, wherein the optimization module is further configuredto enable the computer processor to assign a function with high outboundnetwork traffic to a group of tiles in an area of the grid having highrouting priority.
 5. The system of claim 1, wherein: execution of afunction includes execution of a set of sub-functions by a group oftiles; and the optimization module is further configured to enable thecomputer processor to arrange the set of sub-functions with particulartiles of a group of tiles executing the function for optimal performancein accordance with the static priority routing policy.
 6. The system ofclaim 1, wherein the optimization module is further configured to enablethe computer processor to: determine that a group of tiles executing afirst function most frequently sends data packets to a group of tilesexecuting a second function; and assign execution of the first functionto a first group of tiles more proximate to a second group of tilesexecuting the second function than a majority of all other groups oftiles.
 7. The system of claim 1, wherein the optimization module isfurther configured to enable the computer processor to: determine that agroup of tiles executing a first function most frequently sends datapackets to a group of tiles executing a second function; and assignexecution of the first function to a first group of tiles in a highrouting priority area of the grid with respect to a second group oftiles executing the second function.
 8. The system of claim 1, whereinthe ranking criteria comprises at least one selected from a groupconsisting of overall network traffic of the network-on-chip, networktraffic for high priority functions, overall performance of thenetwork-on-chip, performance for high priority functions, and overallpower consumption of the network-on-chip.
 9. The system of claim 1,wherein the user application comprises at least one selected from agroup consisting of source code, assembly code, and machine code.
 10. Amethod comprising: receiving a user application, wherein the userapplication includes a set of functions; simulating execution ofdifferent configurations of the set of functions on a multi-coremicroprocessor chip, wherein: the multi-core microprocessor chipcomprises a set of tiles arranged in a grid configuration, wherein eachtile comprises a processor core and a corresponding router, wherein eachrouter: is communicatively coupled with at least one other router toform a network-on-chip, and implements the same deterministic staticpriority routing policy, wherein the deterministic static priorityrouting policy comprises assigning unchanging priority levels to theinput ports of the router and routing outbound data in accordance withthe unchanging priority levels, and the different configurations includeexecution of the set of functions by different groups of tiles;monitoring network traffic patterns of the execution of the differentconfigurations; ranking the different configurations according toranking criteria, wherein the ranking criteria is used to rank each ofthe different configurations based on the corresponding network trafficpatterns; and selecting an optimal configuration of the differentconfigurations based on the ranking.
 11. The method of claim 10: furthercomprising receiving an identification of a high priority function ofthe set of functions; and wherein the ranking is based on optimalnetwork traffic patterns for the high priority function.
 12. The methodof claim 10: further comprising determining a high traffic function ofthe set of functions based on the monitoring; and wherein the ranking isbased on optimal network traffic patterns for the high traffic function.13. The method of claim 10, further comprising assigning a function withhigh outbound network traffic to a group of tiles in an area of the gridhaving high routing priority.
 14. The method of claim 10: whereinexecution of a function includes execution of a set of sub-functions bya group of tiles; and further comprising arranging the set ofsub-functions with particular tiles of a group of tiles executing thefunction for optimal performance in accordance with the static priorityrouting policy.
 15. The method of claim 10, further comprising:determining that a group of tiles executing a first function mostfrequently sends data packets to a group of tiles executing a secondfunction; and assigning execution of the first function to a first groupof tiles more proximate to a second group of tiles executing the secondfunction than a majority of all other groups of tiles.
 16. The method ofclaim 10, further comprising: determining that a group of tilesexecuting a first function most frequently sends data packets to a groupof tiles executing a second function; and assigning execution of thefirst function to a first group of tiles in a high routing priority areaof the grid with respect to a second group of tiles executing the secondfunction.
 17. The method of claim 10, wherein the ranking criteriacomprises at least one selected from a group consisting of overallnetwork traffic of the network-on-chip, network traffic for highpriority functions, overall performance of the network-on-chip,performance for high priority functions, and overall power consumptionof the network-on-chip.
 18. The method of claim 10, wherein the userapplication comprises at least one selected from a group consisting ofsource code, assembly code, and machine code.
 19. A method comprising:receiving a user application, wherein the user application includes aset of functions to be executed by a multi-core microprocessor chip,wherein the multi-core microprocessor chip comprises a set of tiles eachincluding a processor core and a corresponding router, wherein eachrouter: is communicatively coupled with at least one other router toform a network-on-chip grid, and implements the same deterministicstatic priority routing policy, wherein the deterministic staticpriority routing policy comprises assigning unchanging priority levelsto the input ports of the router and routing outbound data in accordancewith the unchanging priority levels; receiving an identification of ahigh priority function of the set of functions; identifying one or moretiles with high routing priority according to the static priorityrouting policy; assigning execution of the high priority function to theone or more tiles with high routing priority; and executing the highpriority function in accordance with the assignment.
 20. The method ofclaim 19, wherein the high priority function is a high traffic function.